Network Design with Edge-Connectivity and Degree Constraints
نویسندگان
چکیده
منابع مشابه
Network-Design with Degree Constraints
We study several network design problems with degree constraints. For the degree-constrained 2-connected subgraph problem we obtain a factor 6 violation for the degrees with 4 approximation for the cost. This improves upon the logarithmic degree violation and no cost guarantee obtained by Feder, Motwani, and Zhu (2006). Then we consider the problem of finding an arborescence with at least k ter...
متن کاملNetwork Design with Weighted Degree Constraints
In an undirected graph G = (V,E) with a weight function w : E×V → Q+, the weighted degree dw(v;E) of a vertex v is defined as ∑ {w(e, v) | e ∈ E incident with v}. In this paper, we consider a network design problem with upper-bound on weighted degree of each vertex. Inputs of the problem are an undirected graph G = (V,E) with E = E1 ∪̇ E2 ∪̇ E3, weights w1 : E1 × V → Q+, μ : E2 → Q+, ν : E3 → Q+,...
متن کاملSupply chain network design with multi- mode demand based on acceptance degree of fuzzy constraints violated
This paper designs a mathematical model for supply chain network design problem including plants, distributors and customers in fuzzy environment. Each plant and distributor has several levels capacities. A multi-mode demand strategy is considered for the customers where only one of the modes is to be selected for each customer. Considering the acceptance degree of fuzzy constraints violated, a...
متن کاملApproximating node-connectivity and prize-collecting network-design problems with degree constraints
Motivated by applications to designing peer-to-peer overlays for distributing live streaming media content, we study a variety of network design problems with degree constraints on the nodes. We first consider the problem of finding a 2-node-connected spanning subgraph with degree constraints. Node-connectivity problems with degree constraints present new challenges as compared to their edge co...
متن کاملInverse degree and edge-connectivity
Let G be a connected graph with vertex set V (G), order n = |V (G)|, minimum degree δ and edge-connectivity λ. Define the inverse degree of G as R(G) = ∑ v∈V (G) 1 d(v) , where d(v) denotes the degree of the vertex v. We show that if R(G) < 2 + 2 δ(δ + 1) + n− 2δ (n− δ − 2)(n− δ − 1) , then λ = δ. We also give an analogous result for triangle-free graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2008
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-008-9149-3